Auctions and Takeovers.

ثبت نشده
چکیده

auctions and takeovers. Under Delaware law (the predominant corporate law in the US), when a potential acquirer makes a serious bid for a target, the target's board of directors is required to act as would " auctioneers charged with getting the best price for the stockholders at a sale of the company. " (Revlon v. MacAndrews & Forbes, 173). The target's board may not use defensive tactics that destroy the auction process and must attempt to seek higher bids. Similarly, the Williams Act requires takeover bids to remain open for at least 20 business days on the grounds that the delay facilitates auctions. This preference for auctions follows from the view that auctions maximize shareholder returns. In addition, auctions promote efficiency by shifting corporate assets into the hands of those that value them most highly. And auctions mitigate the collective action problem of target shareholders by requiring the target board to seek the highest bid. Takeover auctions differ from traditional auctions in important respects. In a traditional auction, the seller describes what is being sold and states the auction rules in a public announcement. Takeover auctions are instead prompted by a potential buyer. Only after the buyer has expressed an interest in the target are bids from others sought. The process is governed not by a fixed set of auction rules specified by the seller, but rather by complex takeover regulations, which give the target board some latitude in the process. The process is typically not stated in advance, but evolves as bidders and bids arrive. For the most part, the regulations provide ways to defend against hostile takeovers with poison pills, greenmail, and other tactics. Despite these differences, to a first approximation takeovers are well modeled as an ascending-bid auction with significant participation costs. This essay begins by looking at takeover auctions from the point of view of a buyer, focusing on bidding strategy. Then strategies of the target are discussed. Finally, the desirability of takeover auctions is addressed. It is useful to distinguish between two ideal auction settings: common value and private value auctions. In a common value auction, every bidder has the same value for the target, but the bidders have private estimates of this uncertain value. In a private value auction, each bidder knows its own value, but not the values of other bidders. A takeover to displace bad management in which all bidders have similar …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

All-Pay-All Auctions

We consider a class of auctions in which bidders receive (asymmetric) shares of the amount of money raised. Examples include corporate takeovers when potential acquirers have “toeholds” and auctions used to raise money for a public good. We show that the optimal selling mechanism in these cases is a simple “all-pay-all” auction in which all bidders pay a weighted sum of all bids. When bidders r...

متن کامل

Inefficient rushes in auctions

We analyze a setting common in privatizations, public tenders, and takeovers in which the ex post efficient allocation, i.e., the first best, is not implementable. Our first main result is that the open ascending auction is not second best because it is prone to rushes, i.e., all active bidders quitting simultaneously, that undermine its efficiency. Our second main result is that the second bes...

متن کامل

A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms

Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...

متن کامل

Ine � cient rushes in auctions ⇤

We analyze a setting common in privatizations, public tenders and takeovers in which the ex post e cient allocation, i.e. the first best, is not implementable. Our first main result is that the open ascending auction is not second best because it is prone to rushes, i.e. all active bidders quitting simultaneously, that undermine its e ciency. Our second main result is that the second best can b...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999